//
// Created by xili on 2024/8/12 下午1:32.
// Go big or go home.
//
#include "leetcode.h"

class Solution {
public:
    ListNode *trainningPlan(ListNode *l1, ListNode *l2) {
        ListNode *dummyhead = new ListNode(-1);
        ListNode *cur = dummyhead;
        while (l1 && l2) {
            if (l1->val < l2->val) {
                cur->next = l1;
                l1 = l1->next;
            } else {
                cur->next = l2;
                l2 = l2->next;
            }
            cur = cur->next;
        }
        cur->next = l1 ? l1 : l2;
        return dummyhead->next;
    }
};